Skeleton Clustering: Dimension-Free Density-Aided Clustering
نویسندگان
چکیده
We introduce a density-based clustering method called skeleton that can detect clusters in multivariate and even high-dimensional data with irregular shapes. To bypass the curse of dimensionality, we propose surrogate density measures are less dependent on dimension but have intuitive geometric interpretations. The framework constructs concise representation given as an intermediate step be thought combination prototype methods, clustering, hierarchical clustering. show by theoretical analysis empirical studies leads to reliable scenarios.
منابع مشابه
Context-Aided Human Recognition - Clustering
Context information other than faces, such as clothes, picturetaken-time and some logical constraints, can provide rich cues for recognizing people. This aim of this work is to automatically cluster pictures according to person’s identity by exploiting as much context information as possible in addition to faces. Toward that end, a clothes recognition algorithm is first developed, which uses co...
متن کاملFast Online Clustering with Randomized Skeleton Sets
We present a new fast online clustering algorithm that reliably recovers arbitrary-shaped data clusters in high throughout data streams. Unlike the existing state-of-the-art online clustering methods based on k-means or k-medoid, it does not make any restrictive generative assumptions. In addition, in contrast to existing nonparametric clustering techniques such as DBScan or DenStream, it gives...
متن کاملUnsupervised Clustering Using Fractal Dimension
Clustering can be defined as the process of “grouping” a collection of objects into subsets or clusters. The clustering problem has been addressed in numerous contexts and by researchers in different disciplines. This reflects its broad appeal and usefulness as an exploratory data analysis approach. Unsupervised clustering algorithms have been developed to address real world problems in which t...
متن کاملImprovement of density-based clustering algorithm using modifying the density definitions and input parameter
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...
متن کاملLow-Noise Density Clustering
We study density-based clustering under low-noise conditions. Our framework allows for sharply defined clusters such as clusters on lower dimensional manifolds. We show that accurate clustering is possible even in high dimensions. We propose two data-based methods for choosing the bandwidth and we study the stability properties of density clusters. We show that a simple graph-based algorithm kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2023
ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']
DOI: https://doi.org/10.1080/01621459.2023.2174122